Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(a, x), a) → f(f(f(a, a), f(x, a)), a)

Q is empty.


↳ QTRS
  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(a, x), a) → f(f(f(a, a), f(x, a)), a)

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(a, x), a) → f(f(f(a, a), f(x, a)), a)

The set Q consists of the following terms:

f(f(a, x0), a)


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F(f(a, x), a) → F(f(f(a, a), f(x, a)), a)
F(f(a, x), a) → F(a, a)
F(f(a, x), a) → F(f(a, a), f(x, a))
F(f(a, x), a) → F(x, a)

The TRS R consists of the following rules:

f(f(a, x), a) → f(f(f(a, a), f(x, a)), a)

The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

F(f(a, x), a) → F(f(f(a, a), f(x, a)), a)
F(f(a, x), a) → F(a, a)
F(f(a, x), a) → F(f(a, a), f(x, a))
F(f(a, x), a) → F(x, a)

The TRS R consists of the following rules:

f(f(a, x), a) → f(f(f(a, a), f(x, a)), a)

The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F(f(a, x), a) → F(f(f(a, a), f(x, a)), a)
F(f(a, x), a) → F(a, a)
F(f(a, x), a) → F(f(a, a), f(x, a))
F(f(a, x), a) → F(x, a)

The TRS R consists of the following rules:

f(f(a, x), a) → f(f(f(a, a), f(x, a)), a)

The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 3 less nodes.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ QDP
                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F(f(a, x), a) → F(x, a)

The TRS R consists of the following rules:

f(f(a, x), a) → f(f(f(a, a), f(x, a)), a)

The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


F(f(a, x), a) → F(x, a)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
F(x1, x2)  =  x1
f(x1, x2)  =  f(x2)
a  =  a

Lexicographic path order with status [19].
Quasi-Precedence:
trivial

Status:
a: multiset
f1: [1]


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ QDP
                  ↳ QDPOrderProof
                    ↳ QDP
                      ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f(f(a, x), a) → f(f(f(a, a), f(x, a)), a)

The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.